Exploring the Decision Forest: An Empirical Investigation of Occam's Razor in Decision Tree Induction
نویسندگان
چکیده
We report on a series of experiments in which all decision trees consistent with the training data are constructed. These experiments were run to gain an understanding of the properties of the set of consistent decision trees and the factors that a ect the accuracy of individual trees. In particular, we investigated the relationship between the size of a decision tree consistent with some training data and the accuracy of the tree on test data. The experiments were performed on a massively parallel Maspar computer. The results of the experiments on several arti cial and two real world problems indicate that, for many of the problems investigated, smaller consistent decision trees are on average less accurate than the average accuracy of slightly larger trees.
منابع مشابه
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this principle and search for a small hypothesis within the version space. The principle has been the subject of a heated debate with theoretical and empirical arguments both for and against it. Earlier empirical studies lacked...
متن کاملConditions for Occam's Razor Applicability and Noise Elimination
The Occam's razor principle suggests that among all the correct hypotheses, the simplest hypothesis is the one which best captures the structure of the problem domain and has the highest prediction accuracy when classifying new instances. This principle is implicitly used also for dealing with noise, in order to avoid overrtting a noisy training set by rule truncation or by pruning of decision ...
متن کاملOccam's Razor and a Non-Syntactic Measure of Decision Tree Complexity
Occam's razor, attributed to the fourteenth century English philosopher William of Occam, states: “plurality should not be assumed without necessity.” The machine learning interpretation of Occam’s razor is that if two models have the same performance on the training set, choose the simpler. Decision tree learning widely uses Occam’s razor. Popular decision tree generating algorithms are based ...
متن کاملMinimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justified as being consistent with the principle of Occam’s Razor. Informally, this principle states that one should prefer the simpler hypothesis. In this paper we take this principle to the extreme. Specifically, we formula...
متن کاملWhat Should Be Minimized in a Decision Tree: a Re-examination What Should Be Minimized in a Decision Tree: a Re-examination
This paper examines a recent attempt to justify an inductive bias toward decision trees with few leaves. It is shown that this argument is invalid because it rests upon questionable assumptions, and can be used to deduce contradictory conclusions. Speciically, it can be used to prescribe any inductive bias. In general, it is shown that one cannot justify a preference for any inductive bias over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Artif. Intell. Res.
دوره 1 شماره
صفحات -
تاریخ انتشار 1994